Exact Algorithms for Unit Demand Pricing Problems

نویسنده

  • Michael Hamilton
چکیده

For my final project I study the (nonparametric) unit demand pricing problem from a parametrized perspective. For instances with n items and m customers we give O(m) and O(n) algorithms respectively. We then investigate a price restricted variant of UDP called UDP-PS, and show the problem is fixed parameter tractable when the parameter is the number of customers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint pricing, inventory, and preservation decisions for deteriorating items with stochastic demand and promotional efforts

This study models a joint pricing, inventory, and preservation decision-making problem for deteriorating items subject to stochastic demand and promotional effort. The generalized price-dependent stochastic demand, time proportional deterioration, and partial backlogging rates are used to model the inventory system. The objective is to find the optimal pricing, replenishment, and preservation t...

متن کامل

Pricing in a two-echelon supply chain with different market powers: game theory approaches

In this research, the optimal pricing decisions for two complementary products in a two-echelon supply chain under two scenarios are studied. The proposed supply chain in each echelon includes one retailer and two manufacturers and the same complementary products are produced. In the first scenario, we assume the unit manufacturing costs of the complementary products in each echelon are the sam...

متن کامل

Dynamic Pricing in Smart Grids under Thresholding Policies: Algorithms and Heuristics

Minimizing the peak power consumption and matching demand to supply, under fixed threshold polices, are two key requirements for the success of the future electricity market. In this work, we consider dynamic pricing methods to minimize the peak load and match demand to supply in the smart grid. As these optimization problems are computationally hard to solve in general, we propose generic heur...

متن کامل

Solving the Unit Commitment Problem Using Modified Imperialistic Competition Algorithm

One of the most important problems for power system operation is unit commitment (UC), for which different constraints should be satisfied. UC is a nonlinear and large-scale problem; thus, using the evolutionary algorithms has been considered for solving the problem. In this paper, the solution of the UC problem was investigated using Modified Imperialistic Competition Algorithm (MICA).  Simula...

متن کامل

Application of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems

The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017